On Sparse Interpolation and the Design of Deterministic Interpolation Points
نویسندگان
چکیده
منابع مشابه
On sparse interpolation and the design of deterministic interpolation points
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this topic. We also explore the relation between classical interpolation and sparse interpolation. We second consider the design of the interpolation points for th...
متن کاملInterpolation points and interpolation formulae on the square
The problem of choosing " good " nodes on a given compact set is a central one in multivariate polynomial interpolation. Besides unisolvence, which is by no means an easy problem, for practical purposes one needs slow growth of the Lebesgue constant and computational efficiency. In this talk, we present new sets of nodes recently studied for polynomial interpolation on the square that are asymp...
متن کاملHomogeneous Interpolation on Ten Points
In this paper we prove that for all pairs (d,m) with d/m ≥ 174/55, the linear system of plane curves of degree d with ten general base points of multiplicity m has the expected dimension.
متن کاملPresentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition
Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...
متن کاملHigh dimensional polynomial interpolation on sparse grids
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2014
ISSN: 1064-8275,1095-7197
DOI: 10.1137/13094596x